Merging Scenarios

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Merging Scenarios

Scenario languages define typical executions of systems. They are used to represent output traces, but also to capture requirements of distributed systems. Even if several dialects exist, all scenario languages are based on a similar idea: they depict systems runs as compositions of partially ordered sets of events. A drawback of scenarios is that the number of participants in a given interacti...

متن کامل

Matching and Merging Scenarios Automatically with Alloy

The design of large systems often involves the creation of models that describe partial specifications. Model composition is the process of combining partial models to create a single coherent model. This paper presents an automatic composition technique for creating a sequence diagram from partial specifications captured in multiple sequence diagrams with the help of Alloy. Our contribution is...

متن کامل

Controller selection in a Wireless Mesh SDN under network partitioning and merging scenarios

In this paper we consider a Wireless Mesh Network (WMN) integrating SDN principles. The Wireless Mesh Routers (WMR) are OpenFlow capable switches that can be controlled by SDN controllers, according to the wmSDN (wireless mesh SDN) architecture that we have introduced in a previous work. We consider the issue of controller selection in a scenario with intermittent connectivity. We assume that o...

متن کامل

Disjunctive merging: Quota and Gmin merging operators

When aggregating information from a group of agents, accepting the pieces of information shared by all agents is a natural requirement. In this paper, we investigate such a unanimity condition in the setting of propositional merging. We discuss two interpretations of the unanimity condition. We show that the first interpretation is captured by existing postulates for merging. But the second int...

متن کامل

Declarative Belief Set Merging Using Merging Plans

We present a declarative framework for belief set merging tasks over (possibly heterogeneous) knowledge bases, where belief sets are sets of literals. The framework is designed generically for flexible deployment to a range of applications, and allows to specify complex merging tasks in tree-structured merging plans, whose leaves are the possible belief sets of the knowledge bases that are proc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2005

ISSN: 1571-0661

DOI: 10.1016/j.entcs.2004.08.065